A Simple Analysis for Randomized Online Weighted Paging
نویسندگان
چکیده
We describe a new potential function based proof for anO(log k)-competitive algorithm for weighted paging, and more generally anO(log k/(k−h+1))-competitive algorithm for the weighted (h, k)-paging problem. In contrast to previous results that are based on the online primal-dual framework, our analysis is extremely simple, and we believe that the technique might be useful in the analysis of other related problems.
منابع مشابه
Competitive Analysis of Paging: A Survey
This paper is a survey of competitive analysis of paging. We present proofs showing tight bounds for the competitive ratio achievable by any deterministic or randomized online algorithm. We then go on to discuss variations and reenements of the competitive ratio and the insights they give into the paging problem. Finally, we variations to the online paging problem to which competitive analysis ...
متن کاملImproved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Paging is a prominent problem in the field of online algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. In this paper we address the conjecture in [2], that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, ...
متن کاملPaging Against a Distribution and IP Networking
In this paper we consider the paging problem when the page request sequence is drawn from a distribution, and give an application to computer networking. In the IP-paging problem the page inter-request times are chosen according to independent distributions. For this model we construct a very simple deterministic algorithm whose page fault rate is at most 5 times that of the best online algorit...
متن کاملMinimizing Cache Usage in Paging
Traditional paging models seek algorithms that maximize their performance while using the maximum amount of cache resources available. However, in many applications this resource is shared or its usage involves a cost. In this work we introduce the Minimum Cache Usage problem, which is an extension to the classic paging problem that accounts for the efficient use of cache resources by paging al...
متن کاملIP over connection-oriented networks and distributional paging
Nezt generation wide area networks are very likely t o use connection-oriented protocols such as Asynchronous Transfer Mode (ATM). For the huge existing investment in current IP networks such as the Internet to remain useful, we must devise mechanisms to carry IP traffic over connection-oriented networks. A basic issue is to devise holding policies for virtual circuits carrying datagrams. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010